#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1e5 + 10;

int n, k;
int arr[N];

int main()
{
    cin >> n >> k;
    for (int i = 0; i < n; i++)
        cin >> arr[i];
    sort(arr, arr + n);
    int sz = unique(arr, arr + n) - arr;
    if (k < sz)
        cout << arr[k - 1] << endl;
    else
        cout << "NO RESULT" << endl;
    
    return 0;
}
